Search results for "lattice [space-time]"
showing 10 items of 692 documents
On Extremal Cases of Hopcroft’s Algorithm
2009
In this paper we consider the problem of minimization of deterministic finite automata (DFA) with reference to Hopcroft’s algorithm. Hopcroft’s algorithm has several degrees of freedom, so there can exist different sequences of refinements of the set of the states that lead to the final partition. We find an infinite family of binary automata for which such a process is unique. Some recent papers (cf. [3,7,1]) have been devoted to find families of automata for which Hopcroft’s algorithm has its worst execution time. They are unary automata associated to circular words. However, automata minimization can be achieved also in linear time when the alphabet has only one letter (cf. [14]), so in …
Theory of tailor automata
2019
Abstract In the paper, a fragment of the new theory of tailor automata is presented, within which a deterministic finite automaton was defined. The proposed automaton provides a theoretical model of an informally characterized biomolecular automaton. The idea of working of which is founded on the concept of alternating cut of some double-stranded fragments of DNA, with the use of a restriction enzyme and ligations of some double-stranded fragments of DNA, with the use of the ligase enzyme.
Modulational instability and two-dimensional dynamical structures
2008
A process of nonlinear structure formation on a two-dimensional lattice is proposed. The basic model consists of a two-dimensional lattice equipped at each node with a molecule or dipole rotating in the lattice plane. The interactions involved in the model are reduced to a periodic lattice. Such a discrete system can be applied to the problem of molecule adsorption on a substrate crystal surface, for instance. The continuum approximation of the model leads to a 2-D sine-Gordon system including nonlinear couplings, which itself can be reduced to a 2-D nonlinear Schrodinger equation in the low amplitude limit. Spatio-temporal structure formation is investigated by means of numerical simulatio…
Effective Field Theory and Lattice QCD approaches for hard probes in QCD matter
2018
Hard Probes are an essential tool to discover the properties of the quark-gluon plasma created in heavy-ion collisions. The study of hard probes always involves taking into account very different energy scales, and this is precisely the situation in which Effective Fields Theories (EFTs) are useful. EFTs can be used to separate the short-distance and perturbative physics from the long-distance and non-perturbative. This method combined with Lattice QCD evaluations of the long-distance effects can provide accurate and first principles results. In this proceeding, I will report recent advances in this direction. Results from an EFT computation of quarkonium $R_{AA}$ at $\sqrt{s_{NN}}=5.02\,\t…
On the equation of state for thermal polymer solutions and melts with attractive interaction
1996
We perform Monte Carlo simulations of a lattice model for polymer melts, i. e., the bond fluctuation model in three dimensions. By using an energy parameter that prefers relatively long bonds, the model exhibits a glass transition at low temperatures, in close qualitative similarity to experiment. We modify this model by adding an attractive interaction of variable strength. We demonstrate that a small interaction strength has only a very small effect on the static properties of the melt. For a fixed strength of the potential, the chemical potential is measured by a modified particle-insertion method over a large range of temperatures and densities. The osmotic pressure is obtained by therm…
Numerical stochastic perturbation theory in the Schrödinger functional
2013
The Schr\"odinger functional (SF) is a powerful and widely used tool for the treatment of a variety of problems in renormalization and related areas. Albeit offering many conceptual advantages, one major downside of the SF scheme is the fact that perturbative calculations quickly become cumbersome with the inclusion of higher orders in the gauge coupling and hence the use of an automated perturbation theory framework is desirable. We present the implementation of the SF in numerical stochastic perturbation theory (NSPT) and compare first results for the running coupling at two loops in pure SU(3) Yang-Mills theory with the literature.
New results on classical and quantum counter automata
2019
We show that one-way quantum one-counter automaton with zero-error is more powerful than its probabilistic counterpart on promise problems. Then, we obtain a similar separation result between Las Vegas one-way probabilistic one-counter automaton and one-way deterministic one-counter automaton. We also obtain new results on classical counter automata regarding language recognition. It was conjectured that one-way probabilistic one blind-counter automata cannot recognize Kleene closure of equality language [A. Yakaryilmaz: Superiority of one-way and realtime quantum machines. RAIRO - Theor. Inf. and Applic. 46(4): 615-641 (2012)]. We show that this conjecture is false, and also show several s…
Real-Time Vector Automata
2013
We study the computational power of real-time finite automata that have been augmented with a vector of dimension k, and programmed to multiply this vector at each step by an appropriately selected $k \times k$ matrix. Only one entry of the vector can be tested for equality to 1 at any time. Classes of languages recognized by deterministic, nondeterministic, and "blind" versions of these machines are studied and compared with each other, and the associated classes for multicounter automata, automata with multiplication, and generalized finite automata.
Computational Limitations of Affine Automata
2019
We present two new results on the computational limitations of affine automata. First, we show that the computation of bounded-error rational-values affine automata is simulated in logarithmic space. Second, we give an impossibility result for algebraic-valued affine automata. As a result, we identify some unary languages (in logarithmic space) that are not recognized by algebraic-valued affine automata with cutpoints.
New Results on Vector and Homing Vector Automata
2019
We present several new results and connections between various extensions of finite automata through the study of vector automata and homing vector automata. We show that homing vector automata outperform extended finite automata when both are defined over $ 2 \times 2 $ integer matrices. We study the string separation problem for vector automata and demonstrate that generalized finite automata with rational entries can separate any pair of strings using only two states. Investigating stateless homing vector automata, we prove that a language is recognized by stateless blind deterministic real-time version of finite automata with multiplication iff it is commutative and its Parikh image is …